Robust equilibria in location games

نویسندگان

  • Berno Buechel
  • Nils Roehl
چکیده

In the framework of spatial competition, two or more players strategically choose a location in order to attract consumers. It is assumed standardly that consumers with the same favorite location fully agree on the ranking of all possible locations. To investigate the necessity of this questionable and restrictive assumption, we model heterogeneity in consumers’ distance perceptions by individual edge lengths of a given graph. A profile of location choices is called a “robust equilibrium” if it is a Nash equilibrium in several games which differ only by the consumers’ perceptions of distances. For a finite number of players and any distribution of consumers, we provide a full characterization of all robust equilibria and derive structural conditions for their existence. Furthermore, we discuss whether the classical observations of minimal differentiation and inefficiency are robust phenomena. Thereby, we find strong support for an old conjecture that in equilibrium firms form local clusters.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robust Equilibria in Concurrent Games

We study the problem of finding robust equilibria in multiplayer concurrent games with mean payoff objectives. A (k, t)-robust equilibrium is a strategy profile such that no coalition of size k can improve the payoff of one its member by deviating, and no coalition of size t can decrease the payoff of other players. We are interested in pure equilibria, that is, solutions that can be implemente...

متن کامل

Robust Equilibria of Potential Games

Potential games are games with potential functions. Technically, the potential function defines a refinement concept. We provide justification for this refinement concept using the notion of robustness of equilibria. A Nash equilibrium of a complete information game is said to be robust if every incomplete information game where payoffs are almost always given by the complete information game h...

متن کامل

Approximate robustness of equilibrium to incomplete information

We relax the Kajii and Morris (1997a) notion of equilibrium robustness by allowing approximate equilibria in close incomplete information games. The new notion is termed “approximate robustness”. The approximately robust equilibrium correspondence turns out to be upper hemicontinuous, unlike the (exactly) robust equilibrium correspondence. As a corollary of the upper hemicontinuity, it is shown...

متن کامل

Informationally Robust Equilibria

Informationally Robust Equilibria (IRE) are introduced in Robson (1994) as a refinement of Nash equilibria for e.g. bimatrix games, i.e. mixed extensions of two person finite games. Similar to the concept of perfect equilibria, basically the idea is that an IRE is a limit of some sequence of equilibria of perturbed games. Here, the perturbation has to do with the hypothetical possibility that t...

متن کامل

Robust Opponent Modeling in Real-Time Strategy Games using Bayesian Networks

Opponent modeling is a key challenge in Real-Time Strategy (RTS) games as the environment is adversarial in these games, and the player cannot predict the future actions of her opponent. Additionally, the environment is partially observable due to the fog of war. In this paper, we propose an opponent model which is robust to the observation noise existing due to the fog of war. In order to cope...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • European Journal of Operational Research

دوره 240  شماره 

صفحات  -

تاریخ انتشار 2015